Gorenstein cut polytopes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gorenstein Fano Polytopes Arising from Order Polytopes and Chain Polytopes

Richard Stanley introduced the order polytope O(P ) and the chain polytope C(P ) arising from a finite partially ordered set P , and showed that the Ehrhart polynomial of O(P ) is equal to that of C(P ). In addition, the unimodular equivalence problem of O(P ) and C(P ) was studied by the first author and Nan Li. In the present paper, three integral convex polytopes Γ(O(P ),−O(Q)), Γ(O(P ),−C(Q...

متن کامل

h-Vectors of Gorenstein polytopes

We show that the Ehrhart h-vector of an integer Gorenstein polytope with a unimodular triangulation satisfies McMullen’s g-theorem; in particular it is unimodal. This result generalizes a recent theorem of Athanasiadis (conjectured by Stanley) for compressed polytopes. It is derived from a more general theorem on Gorenstein affine normal monoids M: one can factor K[M] (K a field) by a “long” re...

متن کامل

Gorenstein Polytopes Obtained from Bipartite Graphs

Beck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result, that is, we characterize the torus graphs whose perfect matching polytopes are Gorenstein. Beck et. al. also gave a method to construct an infinite family of...

متن کامل

Grid Graphs, Gorenstein Polytopes, and Domino Stackings

We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in particular, when these polytopes are Gorenstein. We also introduce the notion of domino stackings and present some results and several open questions. Our techniq...

متن کامل

Delaunay polytopes of cut lattices

We continue 3], the study of the lattice L n generated by cuts of the complete graph on a set V n of n vertices. The lattice L n spans an N = ? n 2-dimensional space of all functions deened on a set V 2 n of all unordered pairs of the set V n. We prove that the cut polytope, i.e. the convex hull of all cuts, is an asymmetric Delaunay polytope of L n. Symmetric Delaunay polytopes of a lattice L ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2014

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2013.11.010